The usage of linear transformations has great relevance for datadecorrelation applications, like image and video compression. In that sense,the discrete Tchebichef transform (DTT) possesses useful coding anddecorrelation properties. The DTT transform kernel does not depend on the inputdata and fast algorithms can be developed to real time applications. However,the DTT fast algorithm presented in literature possess high computationalcomplexity. In this work, we introduce a new low-complexity approximation forthe DTT. The fast algorithm of the proposed transform is multiplication-freeand requires a reduced number of additions and bit-shifting operations. Imageand video compression simulations in popular standards shows good performanceof the proposed transform. Regarding hardware resource consumption for FPGAshows 43.1% reduction of configurable logic blocks and ASIC place and routerealization shows 57.7% reduction in the area-time figure when compared withthe 2-D version of the exact DTT.
展开▼
